Preserving the Pyramid of STI Using Buckets
نویسندگان
چکیده
The product of research projects is information. Through the life cycle of a project, information comes from many sources and takes many forms. Traditionally, this body of information is summarized in a formal publication, typically a journal article. While formal publications enjoy the benefits of peer review and technical editing, they are also often compromises in media format and length. As such, we consider a formal publication to represent an abstract to a larger body of work: a pyramid of scientific and technical information (STI). While this abstract may be sufficient for some applications, an in-depth use or analysis is likely to require the supporting layers from the pyramid. We have developed buckets to preserve this pyramid of STI. Buckets provide an archiveand protocol-independent container construct in which all related information objects can be logically grouped together, archived, and manipulated as a single object. Furthermore, buckets are active archival objects and can communicate with each other, people, or arbitrary network services. Buckets are an implementation of the Smart Object, Dumb Archive (SODA) DL model. In SODA, data objects are more important than the archives that hold them. Much of the functionality traditionally associated with archives is pushed down into the objects, such as enforcing terms and conditions, negotiating display, and content maintenance. In this paper, we discuss the motivation, design, and implication of bucket use in DLs with respect to grey literature.
منابع مشابه
Hashing Technique: A New Index Method for High Dimensional Data
As showed in 17], when dimension goes high, sequential scan processing becomes more eecient than most index-based query. In this paper, we propose a new index method for high-dimensional data spaces. This method is based on hashing technique. The basic idea is: First nd a hashing function which puts the given d-dimensional space data into a d-dimensional buckets where d d. Then, we use existing...
متن کاملEffects of Feeding Buckets Number Per Pen on Performance and Behaviour Indicators of Lambs
Twenty-four 35-day-old lambs were distributed to a completely randomized design with 3 treatments to study the effects of number of feeding buckets per pen on performance, haematology and behaviour indicators. Treatments consisted of 8 (T1), 4 (T2) or 2 (T3) feeding buckets/pen (8 lambs/pen). During the experiment, concentrate was fed at 08:30 in individual feeders. Daily dry matter intake (DMI...
متن کاملDeclustering Using Fractals
We propose a method to achieve declustering for cartesian product les on M units. The focus is on range queries, as opposed to partial match queries that older declustering methods have examined. Our method uses a distance-preserving mapping, namely, the Hilbert curve, to impose a linear ordering on the multidimensional points (buckets); then, it traverses the buckets according to this ordering...
متن کاملA Partially Order-Preserving Index Scheme
It has become advantageous in certain scenarios for a database owner to outsource hosting and management of his database to a third party. This approach is known as database as a service or DAS. However, in the case of highly sensitive data, it may be necessary to protect it even from the third party database administrator. As a result, several methods have been proposed that allow for encrypti...
متن کاملNCSTRL+: Adding Multi-Discipline and Multi-Genre Support to the Dienst Protocol Using Clusters and Buckets
We describe NCSTRL+, a unified, canonical digital library for scientific and technical information (STI). NCSTRL+ is based on the Networked Computer Science Technical Report Library (NCSTRL), a World Wide Web (WWW) accessible digital library (DL) that provides access to over 100 university departments and laboratories. NCSTRL+ implements two new technologies: cluster functionality and publishin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999